Bregman distances and Chebyshev sets
نویسندگان
چکیده
A closed set of a Euclidean space is said to be Chebyshev if every point in the space has one and only one closest point in the set. Although the situation is not settled in infinite-dimensional Hilbert spaces, in 1932 Bunt showed that in Euclidean spaces a closed set is Chebyshev if and only if the set is convex. In this paper, from the more general perspective of Bregman distances, we show that if every point in the space has a unique nearest point in a closed set, then the set is convex. We provide two approaches: one is by nonsmooth analysis; the other by maximal monotone operator theory. Subdifferentiability properties of Bregman nearest distance functions are also given. 2000 Mathematics Subject Classification: Primary 41A65; Secondary 47H05, 49J52.
منابع مشابه
Chebyshev Sets, Klee Sets, and Chebyshev Centers with respect to Bregman Distances: Recent Results and Open Problems
In Euclidean spaces, the geometric notions of nearest-points map, farthestpoints map, Chebyshev set, Klee set, and Chebyshev center are well known and well understood. Since early works going back to the 1930s, tremendous theoretical progress has been made, mostly by extending classical results from Euclidean space to Banach space settings. In all these results, the distance between points is i...
متن کاملThe Bregman distance, approximate compactness and convexity of Chebyshev sets in Banach spaces
We present some sufficient conditions ensuring the upper semicontinuity and the continuity of the Bregman projection operator Π g C and the relative projection operator P g C in terms of the D-approximate (weak) compactness for a nonempty closed set C in a Banach space X . We next present certain sufficient conditions as well as equivalent conditions for the convexity of a Chebyshev subset of a...
متن کاملKlee sets and Chebyshev centers for the right Bregman distance
We systematically investigate the farthest distance function, farthest points, Klee sets, and Chebyshev centers, with respect to Bregman distances induced by Legendre functions. These objects are of considerable interest in Information Geometry and Machine Learning; when the Legendre function is specialized to the energy, one obtains classical notions from Approximation Theory and Convex Analys...
متن کاملBregman distance, approximate compactness and convexity of Chebyshev sets in Banach spaces
We present some sufficient conditions ensuring the upper semicontinuity and the continuity of the Bregman projection operator ΠgC and the relative projection operator P g C in terms of the D-approximate (weak) compactness for a nonempty closed set C in a Banach space X. We next present certain sufficient conditions as well as equivalent conditions for the convexity of a Chebyshev subset of a Ba...
متن کاملWorst-Case and Smoothed Analysis of k-Means Clustering with Bregman Divergences
The k-means algorithm is the method of choice for clustering large-scale data sets and it performs exceedingly well in practice. Most of the theoretical work is restricted to the case that squared Euclidean distances are used as similarity measure. In many applications, however, data is to be clustered with respect to other measures like, e.g., relative entropy, which is commonly used to cluste...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Journal of Approximation Theory
دوره 159 شماره
صفحات -
تاریخ انتشار 2009